Dinv and Area
نویسندگان
چکیده
We give a new combinatorial proof of the well known result that the dinv of an (m,n)-Dyck path is equal to the area of its sweep map image. The first proof of this remarkable identity for co-prime (m,n) is due to Loehr and Warrington. There is also a second proof (in the co-prime case) due to Gorsky and Mazin and a third proof due to Mazin.
منابع مشابه
An explicit formula for ndinv, a new statistic for two-shuffle parking functions
In a recent paper, Duane, Garsia, and Zabrocki introduced a new statistic, “ndinv”, on a family of parking functions. The definition was guided by a recursion satisfied by the polynomial 〈∆hmCp1Cp2 . . . Cpk1, en〉, for ∆hm a Macdonald eigenoperator, Cpi a modified Hall-Littlewood operator and (p1, p2, . . . , pk) a composition of n. Using their new statistics, they are able to give a new interp...
متن کاملSweep maps for lattice paths ( extended abstract )
Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the “zeta maps” that have arisen in the study of q, t-Catalan numbers in the course of relating the three statistics of area, bounce and dinv. A sweep map can be defined for words over arbitrary alphabets with arbitrary weights. The latter property ma...
متن کاملA DNA Virus of Drosophila
Little is known about the viruses infecting most species. Even in groups as well-studied as Drosophila, only a handful of viruses have been well-characterized. A viral metagenomic approach was used to explore viral diversity in 83 wild-caught Drosophila innubila, a mushroom feeding member of the quinaria group. A single fly that was injected with, and died from, Drosophila C Virus (DCV) was add...
متن کاملA simpler formula for the number of diagonal inversions of an (m, n)-parking function and a returning fermionic formula
Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has been defined using a complicated generalization of the dinv statistic which is composed of three parts and which is not obviously nonnegative. Here we simplify...
متن کاملSpecial Cases of the Parking Functions Conjecture and Upper-Triangular Matrices
We examine the q = 1 and t = 0 special cases of the parking functions conjecture. The parking functions conjecture states that the Hilbert series for the space of diagonal harmonics is equal to the bivariate generating function of area and dinv over the set of parking functions. Haglund recently proved that the Hilbert series for the space of diagonal harmonics is equal to a bivariate generatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017